package com.maptasksolver.struct.heap;

import com.maptasksolver.struct.graph.Edge;

public class EdgeForHeap extends Edge implements Treeable {

	private double dist;
	
	public EdgeForHeap(int from, int where, double weight, int pathNumber, double dist) {
		super(from, where, weight, pathNumber);
		this.dist = dist;
	}
	
	public EdgeForHeap(Edge e, double dist) {
		super(e.getFrom(), e.getWhere(), e.getWeight(), e.getPathNumber());
		this.dist = dist;
	}
	
	@Override
	public double getValue() {
		return dist;
	}
	
	@Override
	public EdgeForHeap clone() {
		return new EdgeForHeap(this, this.dist);
	}

}
